Representations of Borel Cayley Graphs
نویسندگان
چکیده
There is a continuing search for dense (6, D) interconnection graphs, that is, regular, bidirectional, degree 6 graphs with diameter D and having a large number of nodes. Cayley graphs formed by the Borel subgroup currently contribute to some of the densest (6 = 4, D) graphs for a range of D [l]. However, the group theoretic representation of these graphs makes the development of ef i cient routing algorithms dificult. In an earlier report, we showed that all Cayley gra hs have generalized chordal ring (GCR) representations [2J In this paper, we show that all degree-4 Borel Coyley graphs can also be represented by more restrictive chordal rings (CR) through a constructive proof. A step-by-step algorithm to transform any degree-4 Borel Cayley graph into CR graphs is provided. Examples are used to illustrate this concept.
منابع مشابه
On the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملClass-Congruence Property and Two-Phase Routing of Borel Cayley Graphs
Dense, symmetric graphs are useful interconnection models for multicomputer systems. Borel Cayley graphs, the densest degree4 graphs for a range of diameters [I], are attractive candidates. However, the group-theoretic representation of these graphs makes the development of efficient routing algorithms difficult. In earlier reports, we showed that all degree-4 Borel Cayley graphs have generaliz...
متن کاملPseudo-Random Graphs for Fast Consensus Protocol
In this paper, we focus on the design of network topology to achieve fast information distribution. We present the information distribution performance of Borel Cayley graphs, a family of pseudo-random graphs, is far superior than that of other well-known graph families. To demonstrate the effectiveness of this pseudo-random approach, we compare the convergence speed of the average consensus pr...
متن کاملCayley graphs of finitely generated groups
There does not exist a Borel choice of generators for each finitely generated group which has the property that isomorphic groups are assigned isomorphic Cayley graphs.
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 6 شماره
صفحات -
تاریخ انتشار 1993